Time Efficient Radio Broadcasting in Planar Graphs
نویسندگان
چکیده
We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that radio broadcasting can be completed in D +O(log n) time units in planar graphs of size n, and with diameter D. This improves the currently best known D+O(log n) time schedule proposed by Elkin and Kortsarz in [16] [SODA’05], and 3D time schedule due to Gąsieniec, Peleg and Xin in [23] [PODC’05]. In this paper, we also explore broadcasting in radio networks in the presence of edge failures.
منابع مشابه
Survey on Media Literacy of Radio and Television Program Producers (Case study: Mazandaran Radio and Television Center)
In the recent decades, advanced technologies in production, infrastructure and devices for providing content and services have been provided. The audience can use the media of their interest at any time, with the desired devices .Accordingly, there are many differences in the level of media literacy of the people. This study seeks to determine the level of media literacy of the producer of pro...
متن کاملBroadcasting in planar graphs
For an arbitrary graph on n vertices, the minimum time required to broadcast is pogz n 1, and for any n, there exist graphs on n vertices with broadcast time equal to fIogz n 1. When restricted to planar graphs, this is generally not the case; however, just one additional time unit is sufficient to allow broadcasting in certain planar graphs. We also show that the maximum number of vertices in ...
متن کاملThe Complexity of Broadcasting in Planar and Decomposable Graphs
z Abstract Broadcasting in processor networks means disseminating a single piece of information, which is originally known only at some nodes, to all members of the network. The goal is to inform everybody using as few rounds as possible, that is minimize the broadcasting time. Given a graph and a subset of nodes, the sources, the problem to determine its speciic broadcast time, or more general...
متن کاملEfficient k-Shot Broadcasting in Radio Networks
The paper concerns time-efficient k-shot broadcasting in undirected radio networks. In a k-shot broadcasting algorithm, each node in the network is allowed to transmit at most k times. Both known and unknown topology models are considered. For the known topology model, the problem has been studied before by Ga̧sieniec et al. [14], who established an upper bound of D + O(kn1/(k−2) log n) and a lo...
متن کاملThe complexity of broadcasting in and decomposable graphs planar
Broadcasting in processor networks means disseminating a single piece of information, which is originally known only at some nodes, to all members of the network. The goal is to inform everybody using as few rounds as possible, that is minimize the broadcast time. Given a graph and a subset of nodes, the sources, the problem to determine its specific broadcast time, or more generally to find a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JNW
دوره 3 شماره
صفحات -
تاریخ انتشار 2008